Markov Chain and Adaptive Parameter Selection on Particle Swarm Optimizer
نویسندگان
چکیده
منابع مشابه
Markov Chain and Adaptive Parameter Selection on Particle Swarm Optimizer
Particle Swarm Optimizer (PSO) is such a complex stochastic process so that analysis on the stochastic behavior of the PSO is not easy. The choosing of parameters plays an important role since it is critical in the performance of PSO. As far as our investigation is concerned, most of the relevant researches are based on computer simulations and few of them are based on theoretical approach. In ...
متن کاملThe landscape adaptive particle swarm optimizer
Several modified particle swarm optimizers are proposed in this paper. In DVPSO, a distribution vector is used in the update of velocity. This vector is adjusted automatically according to the distribution of particles in each dimension. In COPSO, the probabilistic use of a ‘crossing over’ update is introduced to escape from local minima. The landscape adaptive particle swarm optimizer (LAPSO) ...
متن کاملRobust Particle Swarm Optimizer based on Chemomimicry
Particle swarm optimizers (PSO) were first introduced by Kennedy and Eberhart as stochastic algorithms which seek optimal solutions to functions through the use of swarm intelligence [1]. The main theme of PSO is that many particles are allowed to explore a function space. As each particle relocates it inputs its coordinates into the objective function for evaluation. Particles are assigned dir...
متن کاملA Parallel Particle Swarm Optimizer
1. Abstract Time requirements for the solving of complex large-scale engineering problems can be substantially reduced by using parallel computation. Motivated by a computationally demanding biomechanical system identification problem, we introduce a parallel implementation of a stochastic population based global optimizer, the Particle Swarm Algorithm as a means of obtaining increased computat...
متن کاملAdaptive Particle Swarm Optimizer: Response to Dynamic Systems through Rank-based Selection
A response method to dynamic changes based on evolutionary computation is proposed for the particle swarm optimizer. The method uses rank-based selection to replace half of the lower fitness population with the higher fitness population, when changes are detected. Time-varying values for the acceleration coefficients are proposed to keep a higher degree of global search and a lower degree of lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Soft Computing
سال: 2013
ISSN: 2229-7103,2229-6735
DOI: 10.5121/ijsc.2013.4201